A Parallel Simulated Annealing Algorithm in PC-Cluster Environments
نویسندگان
چکیده
منابع مشابه
Parallel Recombinative Simulated Annealing: a Genetic Algorithm Parallel Recombinative Simulated Annealing: a Genetic Algorithm
This paper introduces and analyzes a parallel method of simulated annealing. Borrowing from genetic algorithms, an eeective combination of simulated annealing and genetic algorithms, called parallel recombinative simulated annealing, is developed. This new algorithm strives to retain the desirable asymptotic convergence properties of simulated annealing, while adding the populations approach an...
متن کاملAlgorithm Mapping with Parallel Simulated Annealing Algorithm Mapping with Parallel Simulated Annealing ?
This paper presents a parallel simulated annealing algorithm for solving the problem of mapping irregular parallel programs onto homogeneous processor arrays with regular topology. The algorithm constructs and uses joint transformations. These transformations guarantee a high degree of parallelism that is bounded below by d jNpj deg(Gp)+1 e, where jN p j is the number of task nodes in the mappe...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملParallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm
Many significant engineering and scientific problems involve optimization of some criteria over a combinatorial configuration space. The two methods most often used to solve these problems effectively—simulated annealing (SA) and genetic algorithms (GA)—do not easily lend themselves to massive parallel implementations. Simulated annealing is a naturally serial algorithm, while GA involves a sel...
متن کاملA Simulated Annealing Algorithm based on Parallel Cluster for Engineering Layout Design
The layout design problem is a kind of nesting problems that is naturally NP-hard and very difficult to solve. Layout designing of machine is even more difficult because of its nesting items are actually machine parts that have both irregular shapes and complex constraints. A feasible way to solve machine layout problem is to employ ameliorative algorithms, such as simulated annealing algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2000
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.120.5_771